On Complex Interval Arithmetic Using Polar Form

نویسندگان

چکیده

In this paper, complex arithmetic in polar form, briefly sectors is discussed. The fact that the family of not closed under addition and subtraction gives rise to need an optimized approximation. Precisely, problem discussed, determine smallest possible sector contains sum two sectors. An efficient algorithm solving introduced compared with existing algorithms literature. are implemented MATLAB R2020a tested for all cases. It also shown by examples proposed perform much better than their ancestors avoid errors.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complex Interval Arithmetic Using Polar Form

In this paper, the polar representation of complex numbers is extended to complex polar intervals or sectors; detailed algorithms are derived for performing basic arithmetic operations on sectors. While multiplication and division are exactly defined, addition and subtraction are not, and we seek to minimize the pessimism introduced by these operations. Addition is studied as an optimization pr...

متن کامل

Interval Arithmetic Using SSE-2

We present an implementation of double precision interval arithmetic using the single-instruction-multiple-data SSE-2 instruction and register set extensions. The implementation is part of a package for exact real arithmetic, which defines the interval arithmetic variation that must be used: incorrect operations such as division by zero cause exceptions and loose evaluation of the operations is...

متن کامل

Eecient Implementation of Interval Arithmetic Narrowing Using Ieee Arithmetic

We present and analyze several implementations of the interval arithmetic narrowing function for multiplication. Starting from the Cleary algorithm for narrowing multiplication we describe two optimizations which produce code that is 10-15 times faster on the average. Finally, we propose a few simple RISC instructions which would allow eecient execution of interval arithmetic and narrowing rout...

متن کامل

Resolution of nonlinear interval problems using symbolic interval arithmetic

An interval problem is a problem where the unknown variables take interval values. Such a problem can be defined by interval constraints, such as "the interval [a, b] ⊂ [a, b]2". Interval problems often appear when we want to analyze the behavior of an interval solver. To solve interval problems, we propose to transform the constraints on intervals into constraints on their bounds. For instance...

متن کامل

Solving discrete minimax problems using interval arithmetic

We present an interval algorithm for solving discrete minimax problems where the constituent minimax functions are continuously differentiable functions of one real variable. Our approach is based on smoothing the max-type function by exploiting the Jaynes’s maximum entropy [Phys. Rev., 106:620–630, 1957]. The algorithm works within the branchand-bound framework and uses first order information...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Gazi university journal of science

سال: 2022

ISSN: ['2147-1762']

DOI: https://doi.org/10.35378/gujs.833690